More Accurate Polynomial-Time Min-Max Timing Simulation
نویسندگان
چکیده
We describe a polynomial-time algorithm for min-max timing simulation of combinational circuits. Our algorithm reports conservative bounds on the propagationdelays from each primary input to each gate, for use in the timing verification of fundamental-mode asynchronous circuits. A new reconvergent fanout analysis technique is presented. Our algorithm produces more accurate results than previous polynomial-time (and some exponential-time) algorithms in the presence of reconvergent fanouts.
منابع مشابه
Min-Max Timing Analysis and An Application to Asynchronous Circuits
Modern high-performance asynchronous circuits depend on timing constraints for correct operation, so timing analyzers are essential asynchronous design tools. In this paper, we present a 13-valued abstract waveform algebra and a polynomial-time min-max timing simulation algorithm for use in efficient, approximate timing analysis of asynchronous circuits with bounded component delays. Unlike sev...
متن کاملEfficient Algorithms for Approximate Time Separation of Events
Finding bounds on time separation of events is a fundamental problem in verification and analysis of asynchronous and concurrent systems. Unfortunately, even for systems without repeated events or choice, computing exact bounds on time separation of events is an intractable problem when both min and max type timing constraints are present. In this paper, we describe a method for approximating m...
متن کاملAnalyzing Reconvergent Fanouts in Gate Delay Fault Simulation
To determine the quality of gate delay tests, Min/Max delay fault simulation must determine the detectable sizes of faults. In conventional Min/Max timing simulation, correlations at the inputs of reconvergent gates are ignored. This paper shows how correlation information can be used when fanouts reconverge to produce more accurate results.
متن کاملStatistical Timing Analysis with AMECT: Asymptotic MAX/MIN Approximation and Extended Canonical Timing Model
State of the art statistical timing analysis (STA) tools often yield less accurate results when timing variables become correlated due to global source of variations and path reconvergence. To the best of our knowledge, no good solution is available dealing both types of correlations simultaneously. In this paper, we present a novel statistic timing algorithm, AMECT (Asymptotic MAX/MIN approxim...
متن کاملPseudo-polynomial algorithms for min-max and min-max regret problems?
We present in this paper general pseudo-polynomial time algorithms to solve min-max and min-max regret versions of some polynomial or pseudo-polynomial problems under a constant number of scenarios. Using easily computable bounds, we can improve these algorithms. This way we provide pseudo-polynomial algorithms for the min-max and and min-max regret versions of several classical problems includ...
متن کامل